#!/usr/bin/env python

def is_prime(num):
    if num == 1:
        return False
    elif num == 2:
        return True
    else:
        for i in range(2, int(num/2)+1):
            if divmod(num, i)[1] == 0:
                return False

    return True


for a in range(1, 200):
    if is_prime(a):
        print(a)
